fault-tolerant routing algorithm meaning in Chinese
容错路径选择算法
Examples
- The paper will study the upper questions based on the two interconnection networks . first , we give a fault - tolerant routing algorithm under the connectivity of the crossed cube in o ( n ) time and the length of the longest routing path ; second , with the rapid progress in vlsi , the failing probability of processors and links is very low , the traditional connectivity underestimates the resilience of large networks / here by applying the concept " conditional connectivity " introduce by harary , we show that the n - crossed cube can tolerate up to 2n - 3 ( n > 2 ) processors failure and remain connected provide that all the neighbors of each processor do not ' fail at the same time , the result is the same as the hypercube . we also give a related algorithm in o ( n ) time , and the length of the longest path ; third , we apply cluster faun tolerance introduced by q . - p
根据menger定理， n -维交叉立方体可以容纳n - 1个故障顶点，我们给出了它的时间复杂度为o ( n )的容错路由选择算法及其最长路径长度分析；在此基础上本文证明， n -维交叉立方体的条件连通度为2n - 2 ( n 2 ) ，并给出了相应时间复杂度为o ( n )的算法及其最长路径长度；除此之外，本文还证明当n -维交叉立方体中的故障簇个数不大于n - 1 ，其直径不大于1 ，故障顶点总数不超过2n - 3 ( n 2 )时，交叉立方体中任两个无故障顶点都至少有一条可靠路径。 - Therefore , it turned out most important that how to find a new kind fault - tolerance model to hold more faulty nodes and how to design more efficient fault - tolerant routing algorithm to ensure accurate and reliable message passing among non - faulty nodes . hypercube is one of the common interconnection networks
因此,如何找出一种新的网络容错模型以便容纳更多的错误节点,以及如何设计高效的容错路由算法以便保证无故障处理器间正确可靠的信息传递是至关重要的。